On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme

نویسندگان

  • Emmanuel Agullo
  • Abdou Guermouche
  • Jean-Yves L'Excellent
چکیده

Sparse direct solvers, and in particular multifrontal methods, are widely used in various simulation problems. Because of their large memory requirements, the use of out-of-core solvers is compulsory for large-scale problems, where disks are used to extend the core memory. This study is at the junction of two previous independent works: it extends the problem of the minimization of the volume of I/O [3] in the multifrontal method to the more general flexible parent allocation algorithm [7]. We explain how to compute the I/O volume with respect to this scheme and propose an efficient greedy heuristic which significantly reduces the I/O volume on real-life problems in this new context.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing the I/O Volume in an Out-of-Core Sparse Multifrontal Solver

High performance sparse direct solvers are often a method of choice in various simulation problems. However, they require a large amount of memory compared to iterative methods. In this context, out-of-core solvers must be employed, where disks are used when the storage requirements are too large with respect to the physical memory available. In this paper, we study how to minimize the I/O requ...

متن کامل

Numerical solution of unsteady flow on airfoils with vibrating local flexible membrane

  Unsteady flow separation on the airfoils with local flexible membrane (LFM) has been investigated in transient and laminar flows by the finite volume element method. A unique feature of the present method compared with the common computational fluid dynamic softwares, especially ANSYS CFX, is the modification using the physical influence scheme in convection fluxes at cell surfaces. In contr...

متن کامل

Efficient Methods for Out-of-Core Sparse Cholesky Factorization

We consider the problem of sparse Cholesky factorization with limited main memory. The goal is to e ciently factor matrices whose Cholesky factors essentially ll the available disk storage, using very little memory (as little as 16 Mbytes). This would enable very large industrial problems to be solved with workstations of very modest cost. We consider three candidate algorithms. Each is based o...

متن کامل

An out-of-core extension of a parallel sparse multifrontal solver

We describe an out-of-core extension of a parallel sparse multifrontal solver, MUMPS. In a first implementation factors are written to disk as soon as computed whereas the stack memory remains in-core. We then overlap disk accesses with computation and allow some factors to stay incore after factorization, thus enhancing the performance of both the factorization and solution steps. Finally we a...

متن کامل

Policy Model for Sharing Network Slices in 5G Core Network

As mobile data traffic increases, and the number of services provided by the mobile network increases, service load flows as well, which requires changing in the principles, models, and strategies for media transmission streams serving to guarantee the given nature of giving a wide scope of services in Flexible and cost-effective. Right now, the fundamental question remains what number of netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008